Non Interleaving Semantics for CCS and Fast Deadlock Detection
نویسنده
چکیده
This paper proposes a non interleaving semantics for CCS and de nes a class of CCS compositions for which interleaving and non interleaving se mantics are equivalent It also presents a fast software tool for analysis of CCS compositions under non interleaving semantics The tool employs Petri net techniques with multiple transition rings Contact jacek cse unsw oz au
منابع مشابه
Fast Deadlock Detection in CCS Systems Using Petri Nets
This paper proposes a non-interleaving semantics for CCS, and explores its consequences for the state space reduction possibilities in deadlock detection tools. In particular, it defines a class of CCS compositions for which sets of simultaneous actions may replace numerous permutations of single action sequences in such tools. It also presents a fast software tool for deadlock detection/proof ...
متن کاملSelf-independent Petri Nets for Distributed Systems
We propose that the asynchronous mechanism for communication should be considered as a primitive for semantic models of distributed systems in contrast to the synchronous mechanism (hand-shaking) of CSP (Hoare, 1985) or of CCS (Milner, 1989). By doing so, we present an approach to producing a deadlock-free system, and give a denotational model for CCS in a non-interleaving fashion.
متن کاملRepresenting Closed CCS Systems by Petri Nets
This paper describes and proves a simple transformation of CCS composi tions into Petri nets Under certain conditions additional to the CCS syntax rules the resulting Petri nets are nite and ring of their transitions cor responds to handshakes in CCS compositions Such correspondence also holds between simultaneous ring of several transitions and multiple handshakes The transformation has proved...
متن کاملNon-interleaving Operational Semantics for the Pi-calculus – technicalities
We provide a non-interleaving operational semantics for the pi-calculus as asynchronous transition systems, which generalizes the standard interleaving structural operational semantics and unfolds to standard, stable prime event structures. We follow the approach taken by Mukund and Nielsen in providing non-interleaving semantics for CCS by infering the so-called prefixing (structural or subjec...
متن کاملEvent Structure Semantics for CCS and Related Languages
We give denotational semantics to a wide range of parallel programming languages based on the idea of Milner’s CCS [Mil80a], that processes communicate by events of mutual synchronization. Processes are denoted by labeled event structures. Event structures represent concurrency rather directly, as in net theory [Bra80]. The semantics does not simulate concurrency by non-deterministic interleavi...
متن کامل